Note on the computational complexity of least core concepts for min-cost spanning tree games
نویسندگان
چکیده
Various least core concepts including the classical least core of cooperative games are discussed. By a reduction from minimum cover problems, we prove that computing an element in these least cores is in general N P-hard for minimum cost spannning tree games. As a consequence, computing the nucleolus, the nucleon and the per-capita nucleolus of minimum cost spanning tree games is also N P-hard.
منابع مشابه
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Let N = {1, ... ,n} be a finite set of players and K N the complete graph on the node set N w {0}. Assume that the edges of K N have nonnegative weights and associate with each coalition S _~ N of players as cost c(S) the weight of a minimal spanning tree on the node set S u {0}. Using transformation from EXACT COVER BY 3-SETS, we exhibit the tollowing problem to be NP-complete. Given the vecto...
متن کاملOn the Complexity of the Core over Coalition Structures
The computational complexity of relevant corerelated questions for coalitional games is addressed from the coalition structure viewpoint, i.e., without assuming that the grand-coalition necessarily forms. In the analysis, games are assumed to be in “compact” form, i.e., their worth functions are implicitly given as polynomial-time computable functions over succinct game encodings provided as in...
متن کاملMonotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which comprises a variety of games that have enjoyed special attention within AI, in particular, skill games, connectivity games, flow games, voting games, and matching games. Given a threshold, each monotone cooperative gam...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملOn the core and nucleolus of directed acyclic graph games
We introduce directed acyclic graph (DAG) games, a generalization of standard tree games, to study cost sharing on networks. This structure has not been previously analyzed from a cooperative game theoretic perspective. Every monotonic and subadditive cost game – including monotonic minimum cost spanning tree games – can be modeled as a DAG-game. We provide an efficiently verifiable condition s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 52 شماره
صفحات -
تاریخ انتشار 2000